Transition Graphs of Reversible Reaction Systems
نویسندگان
چکیده
We study the transition graphs, and thus, possible computational paths of reaction systems which are reversible according to different notions reversibility. show that in sense our earlier work produce very simple types graphs. A somewhat more complicated, but still quite class graphs is obtained if we consider so-called initialized systems. Finally introduce notion reversibility with lookbehind, this same (and computations) as state diagrams finite
منابع مشابه
Aging processes in reversible reaction-diffusion systems.
Reversible reaction-diffusion systems display anomalous dynamics characterized by a power-law relaxation toward stationarity. In this paper we study in the aging regime the nonequilibrium dynamical properties of some model systems with reversible reactions. Starting from the exact Langevin equations describing these models, we derive expressions for two-time correlation and autoresponse functio...
متن کاملNumerical analysis of reversible A + B ↔ C reaction-diffusion systems
We develop an effective numerical method of studying large-time properties of reversible reaction-diffusion systems of type A + B ↔ C with initially separated reactants. Using it we find that there are three types of asymptotic reaction zones. In particular we show that the reaction rate can be locally negative and concentrations of species A and B can be nonmonotonic functions of the space coo...
متن کاملTransition systems, link graphs and Petri nets
link graphs, which were introduced in Definition 3.23, consist of lean-support equivalence classes of concrete link graphs; that is, they forget the identity of nodes and edges. As promised in Section 2.3 and at the end of Section 3.2, we now provide an example to show that RPOs do not always exist in abstract link graphs. J. J. Leifer and R.Milner 56
متن کاملMultisite reversible geminate reaction.
We provide an analytic solution for diffusion-influenced geminate reaction with multiple (N) reversible binding sites (of which one may be irreversible). The solution obtained in the Laplace domain, for two different initial conditions, is valid for the case when the sites are overlapping spheres with no long-range interactions with the diffusing particle. The possibility to invert into the tim...
متن کاملwatching systems of triangular graphs
a watching system in a graph $g=(v, e)$ is a set $w={omega_{1}, omega_{2}, cdots, omega_{k}}$, where $omega_{i}=(v_{i}, z_{i}), v_{i}in v$ and $z_{i}$ is a subset of closed neighborhood of $v_{i}$ such that the sets $l_{w}(v)={omega_{i}: vin omega_{i}}$ are non-empty and distinct, for any $vin v$. in this paper, we study the watching systems of line graph $k_{n}$ which is called triangular grap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-77102-7_1